Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
A(a(b(x1))) → B(c(a(a(a(x1)))))
A(a(b(x1))) → B(b(c(a(a(a(x1))))))
A(a(b(x1))) → A(a(a(x1)))
The TRS R consists of the following rules:
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
A(a(b(x1))) → B(c(a(a(a(x1)))))
A(a(b(x1))) → B(b(c(a(a(a(x1))))))
A(a(b(x1))) → A(a(a(x1)))
The TRS R consists of the following rules:
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(a(b(x1))) → A(x1)
A(a(b(x1))) → A(a(x1))
A(a(b(x1))) → A(a(a(x1)))
The TRS R consists of the following rules:
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(a(b(x1))) → A(a(a(x1))) at position [0] we obtained the following new rules:
A(a(b(a(b(x0))))) → A(a(b(b(c(a(a(a(x0))))))))
A(a(b(b(x0)))) → A(b(b(c(a(a(a(x0)))))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
A(a(b(x1))) → A(x1)
A(a(b(a(b(x0))))) → A(a(b(b(c(a(a(a(x0))))))))
A(a(b(x1))) → A(a(x1))
A(a(b(b(x0)))) → A(b(b(c(a(a(a(x0)))))))
The TRS R consists of the following rules:
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The finiteness of this DP problem is implied by strong termination of a SRS due to [12].
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
A(a(b(x1))) → A(x1)
A(a(b(a(b(x0))))) → A(a(b(b(c(a(a(a(x0))))))))
A(a(b(x1))) → A(a(x1))
A(a(b(b(x0)))) → A(b(b(c(a(a(a(x0)))))))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
A(a(b(x1))) → A(x1)
A(a(b(a(b(x0))))) → A(a(b(b(c(a(a(a(x0))))))))
A(a(b(x1))) → A(a(x1))
A(a(b(b(x0)))) → A(b(b(c(a(a(a(x0)))))))
The set Q is empty.
We have obtained the following QTRS:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
b(a(A(x))) → A(x)
b(a(b(a(A(x))))) → a(a(a(c(b(b(a(A(x))))))))
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → a(a(a(c(b(b(A(x)))))))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
b(a(A(x))) → A(x)
b(a(b(a(A(x))))) → a(a(a(c(b(b(a(A(x))))))))
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → a(a(a(c(b(b(A(x)))))))
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
B(a(a(x))) → A1(a(a(c(b(b(x))))))
B(b(a(A(x)))) → A1(c(b(b(A(x)))))
B(a(b(a(A(x))))) → A1(a(a(c(b(b(a(A(x))))))))
B(a(b(a(A(x))))) → B(b(a(A(x))))
B(a(a(x))) → A1(c(b(b(x))))
B(b(a(A(x)))) → A1(a(a(c(b(b(A(x)))))))
B(b(a(A(x)))) → B(A(x))
B(b(a(A(x)))) → A1(a(c(b(b(A(x))))))
B(b(a(A(x)))) → B(b(A(x)))
B(a(a(x))) → A1(a(c(b(b(x)))))
B(a(a(x))) → B(x)
B(a(b(a(A(x))))) → A1(a(c(b(b(a(A(x)))))))
B(a(a(x))) → B(b(x))
B(a(b(a(A(x))))) → A1(c(b(b(a(A(x))))))
The TRS R consists of the following rules:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
b(a(A(x))) → A(x)
b(a(b(a(A(x))))) → a(a(a(c(b(b(a(A(x))))))))
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → a(a(a(c(b(b(A(x)))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(a(x))) → A1(a(a(c(b(b(x))))))
B(b(a(A(x)))) → A1(c(b(b(A(x)))))
B(a(b(a(A(x))))) → A1(a(a(c(b(b(a(A(x))))))))
B(a(b(a(A(x))))) → B(b(a(A(x))))
B(a(a(x))) → A1(c(b(b(x))))
B(b(a(A(x)))) → A1(a(a(c(b(b(A(x)))))))
B(b(a(A(x)))) → B(A(x))
B(b(a(A(x)))) → A1(a(c(b(b(A(x))))))
B(b(a(A(x)))) → B(b(A(x)))
B(a(a(x))) → A1(a(c(b(b(x)))))
B(a(a(x))) → B(x)
B(a(b(a(A(x))))) → A1(a(c(b(b(a(A(x)))))))
B(a(a(x))) → B(b(x))
B(a(b(a(A(x))))) → A1(c(b(b(a(A(x))))))
The TRS R consists of the following rules:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
b(a(A(x))) → A(x)
b(a(b(a(A(x))))) → a(a(a(c(b(b(a(A(x))))))))
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → a(a(a(c(b(b(A(x)))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 11 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(b(a(A(x))))) → B(b(a(A(x))))
B(a(a(x))) → B(x)
B(a(a(x))) → B(b(x))
The TRS R consists of the following rules:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
b(a(A(x))) → A(x)
b(a(b(a(A(x))))) → a(a(a(c(b(b(a(A(x))))))))
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → a(a(a(c(b(b(A(x)))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(b(a(A(x))))) → B(b(a(A(x)))) at position [0] we obtained the following new rules:
B(a(b(a(A(x0))))) → B(A(x0))
B(a(b(a(A(x0))))) → B(a(A(x0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(b(a(A(x0))))) → B(A(x0))
B(a(b(a(A(x0))))) → B(a(A(x0)))
B(a(a(x))) → B(x)
B(a(a(x))) → B(b(x))
The TRS R consists of the following rules:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
b(a(A(x))) → A(x)
b(a(b(a(A(x))))) → a(a(a(c(b(b(a(A(x))))))))
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → a(a(a(c(b(b(A(x)))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(a(x))) → B(x)
B(a(a(x))) → B(b(x))
The TRS R consists of the following rules:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
b(a(A(x))) → A(x)
b(a(b(a(A(x))))) → a(a(a(c(b(b(a(A(x))))))))
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → a(a(a(c(b(b(A(x)))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule B(a(a(x))) → B(b(x)) at position [0] we obtained the following new rules:
B(a(a(b(a(A(x0)))))) → B(a(a(a(c(b(b(A(x0))))))))
B(a(a(a(A(x0))))) → B(A(x0))
B(a(a(a(a(x0))))) → B(a(a(a(c(b(b(x0)))))))
B(a(a(a(b(a(A(x0))))))) → B(a(a(a(c(b(b(a(A(x0)))))))))
B(a(a(a(A(x0))))) → B(a(A(x0)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(a(b(a(A(x0)))))) → B(a(a(a(c(b(b(A(x0))))))))
B(a(a(a(a(x0))))) → B(a(a(a(c(b(b(x0)))))))
B(a(a(a(A(x0))))) → B(A(x0))
B(a(a(a(b(a(A(x0))))))) → B(a(a(a(c(b(b(a(A(x0)))))))))
B(a(a(x))) → B(x)
B(a(a(a(A(x0))))) → B(a(A(x0)))
The TRS R consists of the following rules:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
b(a(A(x))) → A(x)
b(a(b(a(A(x))))) → a(a(a(c(b(b(a(A(x))))))))
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → a(a(a(c(b(b(A(x)))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q DP problem:
The TRS P consists of the following rules:
B(a(a(b(a(A(x0)))))) → B(a(a(a(c(b(b(A(x0))))))))
B(a(a(a(a(x0))))) → B(a(a(a(c(b(b(x0)))))))
B(a(a(a(b(a(A(x0))))))) → B(a(a(a(c(b(b(a(A(x0)))))))))
B(a(a(x))) → B(x)
The TRS R consists of the following rules:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
b(a(A(x))) → A(x)
b(a(b(a(A(x))))) → a(a(a(c(b(b(a(A(x))))))))
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → a(a(a(c(b(b(A(x)))))))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We have reversed the following QTRS:
The set of rules R is
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
b(a(A(x))) → A(x)
b(a(b(a(A(x))))) → a(a(a(c(b(b(a(A(x))))))))
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → a(a(a(c(b(b(A(x)))))))
The set Q is empty.
We have obtained the following QTRS:
a(a(b(x))) → b(b(c(a(a(a(x))))))
b(c(a(x))) → x
A(a(b(x))) → A(x)
A(a(b(a(b(x))))) → A(a(b(b(c(a(a(a(x))))))))
A(a(b(x))) → A(a(x))
A(a(b(b(x)))) → A(b(b(c(a(a(a(x)))))))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(b(x))) → b(b(c(a(a(a(x))))))
b(c(a(x))) → x
A(a(b(x))) → A(x)
A(a(b(a(b(x))))) → A(a(b(b(c(a(a(a(x))))))))
A(a(b(x))) → A(a(x))
A(a(b(b(x)))) → A(b(b(c(a(a(a(x)))))))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
b(a(A(x))) → A(x)
b(a(b(a(A(x))))) → a(a(a(c(b(b(a(A(x))))))))
b(a(A(x))) → a(A(x))
b(b(a(A(x)))) → a(a(a(c(b(b(A(x)))))))
The set Q is empty.
We have obtained the following QTRS:
a(a(b(x))) → b(b(c(a(a(a(x))))))
b(c(a(x))) → x
A(a(b(x))) → A(x)
A(a(b(a(b(x))))) → A(a(b(b(c(a(a(a(x))))))))
A(a(b(x))) → A(a(x))
A(a(b(b(x)))) → A(b(b(c(a(a(a(x)))))))
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ Narrowing
↳ QDP
↳ QDPToSRSProof
↳ QTRS
↳ QTRS Reverse
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(b(x))) → b(b(c(a(a(a(x))))))
b(c(a(x))) → x
A(a(b(x))) → A(x)
A(a(b(a(b(x))))) → A(a(b(b(c(a(a(a(x))))))))
A(a(b(x))) → A(a(x))
A(a(b(b(x)))) → A(b(b(c(a(a(a(x)))))))
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
The set Q is empty.
We have obtained the following QTRS:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS
↳ QTRS Reverse
Q restricted rewrite system:
The TRS R consists of the following rules:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
Q is empty.
We have reversed the following QTRS:
The set of rules R is
a(a(b(x1))) → b(b(c(a(a(a(x1))))))
b(c(a(x1))) → x1
The set Q is empty.
We have obtained the following QTRS:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
The set Q is empty.
↳ QTRS
↳ DependencyPairsProof
↳ QTRS Reverse
↳ QTRS Reverse
↳ QTRS
Q restricted rewrite system:
The TRS R consists of the following rules:
b(a(a(x))) → a(a(a(c(b(b(x))))))
a(c(b(x))) → x
Q is empty.